Better connected
نویسندگان
چکیده
منابع مشابه
Community Informatics and Information Systems: Can They Be Better Connected?
There is an ongoing debate in Community Informatics about the need for a stronger conceptual and theoretical base in order to give the field disciplinary cohesion and direction. By investigating the body of reflective thinking in Information Systems, researchers in Community Informatics can develop a more rigorous theoretical context for their work. Information Systems can be considered as a fr...
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملA Better Theoretical Bound to Approximate Connected Dominating Set in Unit Disk Graph
Connected Dominating Set is widely used as virtual backbone in wireless Ad-hoc and sensor networks to improve the performance of transmission and routing protocols. Based on special characteristics of Ad-hoc and sensor networks, we usually use unit disk graph to represent the corresponding geometrical structures, where each node has a unit transmission range and two nodes are said to be adjacen...
متن کاملGraph Theoretical Analysis Reveals: Women’s Brains Are Better Connected than Men’s
Deep graph-theoretic ideas in the context with the graph of the World Wide Web led to the definition of Google's PageRank and the subsequent rise of the most popular search engine to date. Brain graphs, or connectomes, are being widely explored today. We believe that non-trivial graph theoretic concepts, similarly as it happened in the case of the World Wide Web, will lead to discoveries enligh...
متن کاملA Better Approximation Ratio for the Minimum k-Edge-Connected Spanning Subgraph Problem
Consider the minimum k-edge-connected spanning subgraph problem: given a positive integer k and a k-edge-connected graph G, nd a k-edge-connected spanning subgraph of G with minimum number of edges. This problem is known to be NP-complete. Khuller and Raghavachari presented the rst algorithm with a performance ratio smaller than 2 for all k. They proved an upper bound of 1.85 for the performanc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 2013
ISSN: 0028-0836,1476-4687
DOI: 10.1038/nj7434-709a